Some Minimal Shape Decompositions Are Nice
نویسنده
چکیده
In some sense, the world is composed of shapes and words, of continuous things and discrete things. The recognition and study of continuous objects in the form of shapes occupies a significant part of the effort of unraveling many geometric questions. Shapes can be represented with great generality by objects called currents. While the enormous variety and representational power of currents is useful for representing a huge variety of phenomena, it also leads to the problem that knowing something is a respectable current tells you little about how nice or regular it is. In these brief notes I give an intuitive explanation of a result that says that an important class of minimal shape decompositions will be nice if the input shape (current) is nice. These notes are an exposition of the paper by Ibrahim, Krishnamoorthy and Vixie [3] which can be found on the arXiv: http://arxiv.org/abs/1411.0882 and any reference to these notes, should include a reference to that paper as well.
منابع مشابه
On Compatible Star Decompositions of Simple Polygons
We introduce the notion of compatible star decompositions of simple polygons. In general, given two polygons with a correspondence between their vertices, two polygonal decompositions of the two polygons are said to be compatible if there exists a one-to-one mapping between them such that the corresponding pieces are defined by corresponding vertices. For compatible star decompositions, we also...
متن کاملEvaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended
The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.
متن کاملSimplicial tree-decompositions of infinite graphs, I
This paper is intended as an introduction to the theory of simplicial decompositions of graphs. It presents, in a unified way, new results as well as some basic old ones (with new proofs). Its main result is a structure theorem for infinite graphs with a simplicial tree-decomposition into primes. The existence and uniqueness of such prime decompositions will be investigated in two subsequent pa...
متن کاملThe geometry of rank decompositions of matrix multiplication II: 3×3 matrices
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix multiplication decompositions, give a geometric proof of the theorem of [3] establishing the symmetry group of Strassen’s algorithm, and present two particularly nice s...
متن کاملClassical quasi-primary submodules
In this paper we introduce the notion of classical quasi-primary submodules that generalizes the concept of classical primary submodules. Then, we investigate decomposition and minimal decomposition into classical quasi-primary submodules. In particular, existence and uniqueness of classical quasi-primary decompositions in finitely generated modules over Noetherian rings are proved. More...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1504.04839 شماره
صفحات -
تاریخ انتشار 2015